Linear time algorithms for NP-hard problems restricted to partial k-trees
نویسندگان
چکیده
منابع مشابه
Linear time algorithms for NP-hard problems restricted to partial k-trees
We present and illustrate by a sequence of examples an algorithm paradigm for solving NPhard problems on graphs restricted to partial graphs of k-trees and given with an embedding in a k-tree. Such algorithms, linear in the size of the graph but exponential or superexponential in k, exist for most NP-hard problems that have liiear time algorithms for trees. The examples used are optimization pr...
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملFixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
This thesis investigates the question to which extent large instances of NP-hard graph and hypergraph problems arising in industrial applications can be solved optimally. A widely accepted conjecture in computational complexity theory is that NP-hard problems cannot be solved optimally in a time growing polynomially in the input instance size. The approach to overcome this difficulty investigat...
متن کاملAlgorithms for Vertex Partitioning Problems on Partial k-Trees
In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible as solutions for practical applications. We give a precise characterization of vertex partitioning problems,...
متن کاملLec . 1 : Approximation Algorithms for NP - hard problems
In this course, we will be studying, as the title suggests, the approximability and inapproximability (limits of approximability) of different combinatorial optimization problems. All the problems we will be looking at will be ones that lack efficient algorithms and in particular will be NP-hard problems. The last two-three decades has seen remarkable progress in approximation algorithms for se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1989
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90031-0